Method for coding and transmitting transport format combination indicator

ABSTRACT

A method and matrixes for transmitting an transport format combination indicator is disclosed. The matrixes according to the invention comprising five column vectors of 32 elements of binary code derived from OVSF codes which are to be multiplied to the lower bits of a TFCI and one column vector of 32 elements of 1 when ( 32,6 ) codes are used.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a mobile telecommunication of thirdgeneration, and more particularly to a method for transmitting atransport format combination indicator (TFCI) inserted to each time slotof a radio frame in a mobile telecommunication system using a W-CDMAstandard.

2. Discussion of the Related Art

Generally, a Third Generation Partnership Project (3GPP) group describesa definition of a physical channel of an upward link and a downward linkof Radio Access Network (RAN). Here, a Dedicated Physical Channel (DPCH)comprises three-layer structure of super frames, radio frames and timeslots. FIGS. 1 and 2 show two data structures of the DPCH. The firsttype is a Dedicated Physical Data Channel (DPDCH) for transferringdedicated data, and the second type is a Dedicated Control Channel(DPCCH) for transferring a control information.

FIG. 1 shows a data structure of an upward link DPCH according to thestandard of 3GPP RAN, while FIG. 2 shows a data structure of a downwardlink DPCH. In FIGS. 1 and 2, the DPCCH includes a TFCI field in eachtime slot constituting a radio frame. In other words, information on atransmission format, i.e. TFCI, is coded and inserted into each radioframe.

The coding of the TFCI bits according to the 3GPP standard will next beexplained.

The number of TFCI bits is variable from a minimum of 1 bit to a maximumof 10 bits, and the number of bits is determined from the point in timewhen a call starts through a signal processing of an upper layer,Different coding methods are applicable to the TFCI depending upon thenumber of bits. When the number of TFCI bits is less than 6, abi-orthogonal coding or a first Reed-Muller coding is applicable. Whenthe number of the TFCI bits is greater than 7, a second Reed-Mullercoding is applicable. According to the 3GPP standard, the coded TFCIundergoes a puncturing to generate a code word of 30 bit length.

For example, when the number of TFCI bits, determined by upper layersignaling, is less than 6, a TFCI code word is output through abi-orthogonal coding. Here, a (32, 6) coding is applicable to thebi-orthogonal coding. For that purpose, if the TFCI consists of lessthan 6 bits, a padding procedure is first executed to supplement thedeficient bit value with “0” from the Most Significant Bit (MSB).Thereafter, the TFCI code word is inserted into each time slot of aradio frame by two bits. However, the entire length is restricted to be30 bits. Thus, the TFCI code word of 32 bits, which has beenbi-orthogonal coded, is punctured by 2 bits and inserted into each timeslot.

In another example, when the number of TFCI bits determined by upperlayer signaling not more than 10 bits, a TFCI code word is outputthrough a second Reed-Muller coding. Here, a (32, 10) coding isapplicable to the second Reed-Muller coding. For that purpose, if theTFCI bits are less than 10, a padding procedure is first executed tosupplement the deficient bits with “0” from the MSB. The Reed-Mullercoded TFCI code word is referred to as a sub-code, Accordingly, thesub-code is punctured by 2 bits to also generate a TFCI code word of 30bit length. FIG. 3 is a block diagram illustrating a channel codingprocess.

The code word of 30bit length generated as described above is dividedinto fifteen 2-bits and inserted into each time slot for transfer. FIG.4 is a diagram showing a typical insertion of the coded TFCI code wordinto each time slot.

Also, FIG. 5 is a diagram illustrating an encoding structure forgenerating a (32, 10) TFCI code word according to the conventionalsecond Reed-Muller coding. Referring to FIG. 5, the TFCI bits, variablefrom 1 to 10 bits are input to an encoder. The input data bit islineally combined with 10 basis sequences. Namely, the basis sequences(32 element vectors) used for the linear combination comprises of auniform code, in which all bit values are “1”; five orthogonal variablespreading factor codes represented by {C32, 1, C32, 2, C32, 4, C32, 8,C32, 16} as shown in Table 1; and four mask codes represented by {Mask1,Mask2, Mask3, Mask4} as shown in Table 2. In the conventional secondReed-Muller coding, the four mask codes are used to increase the numberof code word by 16 times.

TABLE 1 C32,1 0000 0000 0000 0000 1111 1111 1111 1111 C32,2 0000 00001111 1111 0000 0000 1111 1111 C32,4 0000 1111 0000 1111 0000 1111 00001111 C32,8 0011 0011 0011 0011 0011 0011 0011 0011 C32,16 0101 0101 01010101 0101 0101 0101 0101

TABLE 2 Mask1 0010 1000 0110 0011 1111 0000 0111 0111 Mask2 0000 00011100 1101 0110 1101 1100 0111 Mask3 0000 1010 1111 1001 0001 1011 00101011 Mask4 0001 1100 0011 0111 0010 1111 0101 0001

Table 3 below shows the prior basis sequences, in which M_(i,0) is theuniform code; M_(i,1)˜M_(i,5) respectively corresponds to C_(32,1),C_(32,2), C_(32,4), C_(32,8), and C_(32,16); and M_(i,6)˜M_(i,9)respectively corresponds to Mask1˜Mask4.

TABLE 3  i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9)  0  1 0 0 0 0 0 0 0 0 0  1  1 0 0 0 0 1 0 0 0 0 2  1 0 0 0 1 0 1 0 0 0  3  1 0 0 0 1 1 0 0 0 1  4  1 0 0 1 0 0 1 0 1 1 5  1 0 0 1 0 1 0 0 0 1  6  1 0 0 1 1 0 0 0 1 0  7  1 0 0 1 1 1 0 1 0 0 8  1 0 1 0 0 0 0 1 1 0  9  1 0 1 0 0 1 1 1 1 0 10   1 0 1 0 1 0 1 0 1 111   1 0 1 0 1 1 0 0 1 1 12   1 0 1 1 0 0 0 1 1 0 13   1 0 1 1 0 1 0 1 01 14   1 0 1 1 1 0 1 0 0 1 15   1 0 1 1 1 1 1 1 1 1 16   1 1 0 0 0 0 1 00 0 17   1 1 0 0 0 1 1 1 0 0 18   1 1 0 0 1 0 1 1 0 1 19   1 1 0 0 1 1 10 1 0 20   1 1 0 1 0 0 0 1 1 1 21   1 1 0 1 0 1 0 1 0 1 22   1 1 0 1 1 00 0 1 1 23   1 1 0 1 1 1 0 1 1 1 24   1 1 1 0 0 0 0 1 0 0 25   1 1 1 0 01 1 1 0 1 26   1 1 1 0 1 0 1 0 1 0 27   1 1 1 0 1 1 1 0 0 1 28   1 1 1 10 0 0 0 1 0 29   1 1 1 1 0 1 1 1 0 0 30   1 1 1 1 1 0 1 1 1 0 31   1 1 11 1 1 1 1 1 1

The TFCI bits are lineally combined with the basis sequences describedabove and can be expressed by Equation 1, in which a₀ represents theLeast Significant Bit (LSB), while a_(n−1) represents the MSB.

a _(n−1) , a _(n−2) , . . . , a ₁ , a ₀(n≦10)  [Equation 1]

A TFCI code word of 30 bit length is subsequently output by puncturingthe first and the 17^(th) bits from the (32, 10) sub-code generated bythe linear combination.

The output TFCI code word of 30 bit length can be expressed by Equation2:

b ₀ , b ₁ , b ₂ , . . . , i ₂₈, b₂₉  [Equation 2]

Namely, the TFCI bits are input as expressed by Equation 1 are encodedby Equation 3 below to output the TFCI code word as expressed byEquation 2:

b _(i)=Σ(a _(a) ×M _(i,n))mod2(from n=0 to n=9, where i=0, 2, . . . ,31)  [Equation 3]

However, the TFCI encoding according to the technology in the relatedart as described above poses the following problems. First, the patternof the TFCI bits input for encoding are improper because of the paddingprocedure necessary when the TFCI bits are input for coding.Particularly, when the TFCI bits for coding is less than 10, a paddingprocedure is typically executed to supplement the deficient bit valueswith “0” from the MSB. Therefore, a complex decoding procedure isnecessary to decode: the encoded and transmitted TFCI code words at areceiving party. Namely, a bi-orthogonal coding is necessary even whenthe input TFCI bits is less than 6. Thus, the receiving party needs toperform a priority check to confirm from which set the OVSF code, usedfor the encoding, has been selected between two OVSF code sets which arein binary complement relations. As a result, additional process andhardware are required.

Also, when two bits are punctured to generate a (30, 10) TFCI code word,inserted and transmitted to the actual TFCI field from the (32, 10) codeword, a minimum hamming distance loss is up to 2 at maximum.Furthermore, although not explained above, one bit is punctured in a(16, 5) code word to generate a (15, 5) TFCI code word, In such case, aminimum hamming distance loss also occurs.

SUMMARY OF THE INVENTION

Accordingly, an object of the present invention is to solve at least theproblems and disadvantages of the related art.

Particularly, an object of the present invention is to allow an easydecoding of TFCI in a mobile telecommunication system of the thirdgeneration under a W-CDMA standard.

Another object of the present invention to provide an optimal matrix forbasis sequences for TFCI coding.

A still another object of the present invention to provide a method forencoding the TFCI with an optimal matrix for basis sequences.

A further object of the present invention to provide an optimal matrixfor basis sequences for TFCI coding which can maximize a minimum hammingdistance with respect to a TFCI code word when inserting one or two bitsinto each time slot and transmitting after puncturing the TFCI code wordused in the mobile telecommunication system under the W-CDMA standard.

A still further object of the present invention to provide a method forencoding the TFCI with an optimal matrix for basis sequences which canmaximize a minimum hamming distance with respect to a TFCI code wordwhen inserting one or two bits into each time slot and transmittingafter puncturing the TFCI code word used in the mobile telecommunicationsystem under the W-CDMA standard.

Additional advantages, objects, and features of the invention will beset forth in part in the description which follows and in part willbecome apparent to those having ordinary skill in the art uponexamination of the following or may be learned from practice of theinvention. The objects and advantages of the invention may be realizedand attained as particularly pointed out in the appended claims.

To achieve the objects and in accordance with the purposes of theinvention, as embodied and broadly described herein, two optimal basissequences for TFCI code are disclosed.

If the TFCI is not more than 10 bits, it is padded with zeros to 10 bitsby setting the most significant bits to zero if the bits are less than10. The resultant 10 bit TFCI is encoded by the (32, 10) sub-code ofsecond order Reed-Muller code. The transmitted code words are linearlycombined with 10 basis sequences: {M₀, M₁, . . . , M₉}. The basissequences are linearly combined with TFCI bits as M₀ to the leastsignificant bit and M₉ to the most significant bit.

One of the basis sequences of the present invention is as follows:{M₀=(All 1's), M₁=C_(32,16), M₂=C_(32,8), M₃=C_(32,4), M₄=C_(32,2),M₅C_(32,1), M₆=Mask1, M₇=Mask2, M₈=Mask3, M₉=Mask4}. With this basissequence, the TFCI coding scheme for Wide-band Code Divisional MultipleAccess Frequency Division Duplex (W-CDMA FDD) standard achieve morediversity gain in fading channel, which results in 0.5-2.5 dB gain incase of 2-5 bits length TFCI.

An alternate basis sequences of the present invention is as follows:{M₀=C_(32,16), M₁=C_(32,8), M₂=C_(32,4), M₃=C_(32,2), M₄=C_(32,1),M₅=(All 1's), M₆=Mask1, M₇=Mask2, M₈=Mask3, M₉=Mask4}. With is basissequence, the TFCI coding, scheme for FDD standard achieves almost thesame diversity gain as that of the former.

Since the basis of OVSF codes C_(32,1), C_(32,2), C_(32,4), C_(32,8),C_(32,16) correspond to that of Hadamard codes H_(5,16), H_(5,8),H_(5,4), H_(5,2), H_(5,1) of length 2⁵=32, optimizing the input patternis equivalent to exchanging the basis codes from (M₀=all 1 s,M₁=C_(32,1), M₂=C_(32,2), M₃=C_(32,4), M₄=C_(32,8), M₅=C_(32,1), M₆, M₇,M₈, M₉) to (M₀=H_(5,1)=C_(32,16), M₁=H_(5,2)=C_(32,8),M₂=H_(5,4)=C_(32,4), M₃=H_(5,8)=C_(32,2), M₄=H_(5,16)=C_(32,1), M₅=all 1s, M₆, M₇, M₈, M₉).

Therefore, a method according to the present invention for encoding theTFCI comprises determining the number of TFCI bits; Repeating a₀ 32times for coding, if the TFCI consist of 1 bit; and linearly mapping tTFCI information bits a₀, a₁, a₂, a₃, a₄, a₅, a₆, a₇, a₈, a₉ (a₀ is LSBand a₉ is MSB) to the basis sequences, if the TFCI consist of more than2 bits.

A method according to th present invention for encoding TFCI in splitmode comprises determining the number of TFCI bits; Repeating a₀ 16times for coding if the TFCI consist of 1 bit; and linearly mapping theTFCI information bits a₀, a₁, a₂, a₃, a₄ (a₀ is LSB and a₄ is MSB) tothe basis sequences, if the TFCI consist of more than 2 bits.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be described in detail with reference to thefollowing drawings in which like reference numerals refer to likeelements wherein:

FIG. 1 is a diagram illustrating a structure of an upward link DPCH inaccordance with a 3GPP RAN standard in the related art;

FIG. 2 is a diagram illustrating a structure of a downward link DPCH inaccordance with the 3GPP RAN standard in the related art;

FIG. 3 is a block diagram illustrating a channel coding with respect toTFCI bits in the related art;

FIG. 4 is a diagram illustrating an insertion of a coded TFCI code wordinto each time slot in the related art;

FIG. 5 is a diagram illustrating a conventional structure of an encoderfor generating a (32, 10) TFCI code word by the conventional secondorder Reed-Muller coding;

FIGS. 6 is a diagram illustrating converted patterns of TFCI bits whenthe concept of present invention is applied to a conventional TFCIencoder;

FIG. 7 is a diagram illustrating a structure of the conventional TFCIencoder, to which the converted TFCI bit patterns according to thepresent invention are applicable;

FIG. 8 is a diagram illustrating a detailed structure of theconventional TFCI encoder when the TFCI bits according to the presentinvention is applicable:

FIG. 9 is a block diagram illustrating the conventional TFCI encoder ofFIG. 8;

FIGS. 10a to 10 c are diagrams illustrating structures of a decoder inaccordance with the number of input bits of the TFCI bits according tothe present invention;

FIG. 11 is a diagram illustrating a structure of the TFCI encoderaccording to a first embodiment of the present invention;

FIG. 12 is a diagram illustrating a structure of the TFCI encoderaccording to a second embodiment of the present invention;

FIG. 13 is a block diagram illustrating a TFCI decoding procedureaccording to the present invention;

FIG. 14 is a diagram illustrating a structure of a (32, 10) TFCI encoderaccording to the present invention;

FIG. 15 is a diagram illustrating a structure of a (16, 5) TFCI encoderfor split mode according to the present invention;

FIG. 16 is a block diagram illustrating a structure of twin (16, 5) TFCIencoder for split mode according to the present invention;

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Reference will now be made in detail to the present invention, examplesof which are illustrated in the accompanying drawings. In the followingdescription, well-known functions or constructions are not described indetail.

In the past, bi-orthogonal coding, which is the first order Reed-Mullercoding, and the second order Reed-Muller coding were applicableaccording to the number of bits of the TFCI bits input for the TFCIencoding. In the present invention, when the number of bits of the inputTFCI bits is less than 6, the bit patterns shown in FIG. 6 is applied sothat only an OVSF coding rather than the bi-orthogonal coding can beapplicable. Bit patterns different from the conventional bit patternsare also applied when the number of bits of the TFCI bits is greaterthan 6, depending on the cases.

FIG. 6 is a pattern of TFCI bits applicable to the TFCI encodingaccording to the present invention and FIG. 7 is a diagram illustratinga structure of the conventional TFCI encoder, to which the TFCI bitpatterns according to the present invention are applicable.

Referring to FIG. 6, when the input TFCI bits are less than 6, a bitpattern in which the deficient bit values has been supplemented with “0”from-the MSB (a₅), unlike the prior bit pattern, and has beenbarrel-shifted becomes an input of the TFCI encoding to perform the OVSFcoding without the bi-orthogonal coding. Also, when the number of theinput TFCI bits is greater than 6, a barrel-shifted bit pattern of theprior bit pattern for 6 bits of the lower side, while the same bitpattern as the prior bit pattern is input to the 4 bits of the upperside (the TFCI bits linearly combined with the mask code of the basissequences).

FIGS. 8 and 9 show the construction of hardware for performing the TFCIencoding, to which the bit pattern of FIG. 6 is applied. Namely. FIG. 8is a diagram illustrating a detailed structure of the conventional TFCIencoder when the exchanged TFCI bits of FIG. 6 according to the presentinvention is applicable, and FIG. 9 is a block diagram illustrating thestructure of TFCI encoder when the TFCI bits pattern of FIG. 6 isapplied according to the present invention. As shown in FIGS. 8 and 9,when the number of bits of the input TFCI bits is less than 6, a simplehardware has been added to allow the OVSF encoding.

In short, the TFCI bit patterns input to the TFCI encoder as shown inFIG. 7 can be expressed by Equation 4, where X_(i) represents anaggregate composed of ten elements input to the TFCI encoder, i.e., avector representing each TFCI bits. Here, FIG. 6 is one of a detailedpattern expressed by the Equation 4.

X _(i) =[x _(i,0) x _(i,1) , . . . , x _(i,j) , . . . , x _(i,9)](where, 1≦i≦10, and 0≦j≦9)  [Equation 4]

In the TFCI bit patterns applicable to the TFCI encoder according to thepresent invention, the TFCI encoder performs coding as follows withrespect to each input. First, when the number of bits of the TFCIdetermined by the upper layer is less than 6, the OVSF coding isperformed. Second, when the number of bits of the TFCI determined by theupper layer is 6, the bi-orthogonal coding, which is the first orderReed-Muller coding, is performed. Third, when the number of bits of theTFCI determined by the upper layer is greater than 6, the second orderReed-Muller coding is performed. The TFCI code word generated by theabove coding in accordance with the number of input bits of each TFCI istransmitted to the receiving party. The receiving party then decodes thesame.

The decoding performed by the receiving party with respect to the TFCIcode word will next be described below.

According to the present invention, an OVSF coding is directly performedwithout the bi-orthogonal coding when the number of bits of the inputTFCI bits is less than 6. Thus, the receiving party need not undergo apriority check to detect the set to which the OVSF code used for theencoding belongs from the two OVSF code sets that are in binarycomplement relations. FIG. 10a to 10 c are diagrams illustratingstructures of a decoder in accordance with the number of input bits ofthe TFCI according to the present invention.

FIG. 10a shows a structure of a decoder according to the presentinvention when the number of input bits of the TFCI is greater than 6.

The receiving party first multiplies the TFCI code word r(t) by“a₆M₁+a₇M₂+a₈M₃+a₉M₄,” through multiplier 10. Here, the TFCI code wordr(t) has been transmitted after the second Reed-Muller coding andpuncturing, and “a6M₁+a₇M₂+a₈M₃+a₉ M₄” has been obtained by linearlycombining four or less of mask codes M₁, M₂, M₃, M₄ among the basissequences with 4 bits a, a₇, a₈, a₉ of the upper side of the TFCI bitsin the course of encoding by the sending party. Thereafter, decoding isperformed through a Fast Hadamard Transform (FHT) decoding block 11.

Subsequently, the decoded and transformed code word is converted to anOVSF code index in the index conversion block 12. The code indexconversion is required to obtain the correct TFCI from the TFCI codeword received because the relation between the Hadamard code index andthe OVSF code index is in a base inversion (index conversion). Uponcompletion of code index conversion, information on the code index canbe obtained. However, a priority checking block 13 is necessary becausethe receiving part has no information that the set to which the OVSFcode used for the encoding belongs to from the two OVSF code sets thatare in binary complement relations. That is, the code word used for theencoding has been selected between the two OVSF code sets that are inbinary complement relations in accordance with the least significant bit(a₀) of the transmitter.

The output of the priority checking block 13 is stored in a storage andcomparison block 14. The outputs of the priority checking block 13 isstored for all other combinations of “a₆, a₇, a₈, a₉” by repeating theprocedures of above blocks. OVSF codes and a uniform code of “a₀, a₁,a₂, a₃, a₄, a₅” which has a maximum likelihood to a particularcombination that of “a₆, a₇, a₈, a₉” are then selected through acomparison procedure, thereby restoring the desired TFCI informationbits a₀, a₁, a₂, a₃, a₄, a₅, a₆, a₇, a₈, a₉ (a₀ is LSB and a₉ i

FIG. 10b shows a decoder structure according to the present inventionwhen the number of input bit of the TFCI bits of each type is less than6.

The receiving party first decodes the TFCI code word r(t), which hasbeen transmitted after the OVSF coding and puncturing, through an FHTdecoding block 21. The decoded and transformed code word is converted toan OVSF code index in the index conversion block (not shown in thedrawings). Because the relation between the Hadamard code index and theOVSF code index is a base inversion, the code index conversion describedabove is required to obtain correct TFCI from the TFCI code wordreceived.

When the bit pattern suggested by the present invention is applied, theTFCI bits, which has undergone the base inversion in advance throughbarrel shifting, is OVSF-encoded and transmitted. Thus, unlike thedecoder structure shown in FIG. 10a, the index conversion block isunnecessary. Also, when the bit pattern suggested by the presentinvention is applied, the OVSF coding is used. Therefore, prioritychecking block is unnecessary to detect the set to which the OVSF codeused for the encoding belongs to from the two OVSF code sets that are inbinary complement relations. The output of the FHT decoding block 21 isstored in a storage and comparison block 22, thereby restoring thedesired TFCI bits “a₀, a₁, a₂, a₃, a4, a₅.”

FIG. 10c shows a decoder structure according to the present inventionwhen the number of input bit of the TFCI bits is 6.

The receiving part first decodes the TFCI code word r(t), which has beentransmitted after the first order Reed-Muller coding (bi-orthogonalcoding) and puncturing, through an FHT decoding block 31. The decodedand transformed code word is converted to an OVSF code index in theindex conversion block (not shown in the drawings). Because the relationbetween the Hadamard code index and the OVSF code index is a baseinversion, the code index conversion described above is required inorder to obtain correct TFCI from the TFCI code word received.

When the bit pattern suggested by the present invention is applied, theTFCI bits, which has undergone the base inversion in advance throughbarrel shifting, is OVSF-encoded and transmitted. Thus, unlike thedecoder structure shown in FIG. 10a, the index conversion block is alsounnecessary. However, a priority checking block 32 is implemented todetermine which OVSF code was used for encoding between the two OVSFcode sets that are in binary complement relations. The reason is becauseeither one of the two OVSF code sets that are in binary complementrelations is selected by the sending party according to the bit value ofa₀, which is the LSB. The output of the priority checking block 32 isstored in a storage and comparison block 33, thereby restoring thedesired TFCI bits “a₀, a₁, a₂, a₃, a₄, a₅.”

A mechanism of TFCI encoding procedure and decoding procedure accordingto the present invention will be described below. Namely, prioritychecking is not required when the number of input bits of the TFCI bitsof each type suggested by the present invention is less than 6 as shownin FIG. 10, and no index conversion is required when the number of inputbits of the TFCI bits of the present invention is less than 6 as shownin FIG. 10b. From the mathematical perspective, the OVSF code can beclassified into codes generated by Rademacher function Rn(t) defined byEquation 5, where R₀(t) 1.

R_(n)(t)=sgn(sin 2^(n)πt)

where, t∈(0, T)

n=1,2, . . . , log₂N=K

sgn(x)=(−1, for x<0)

(0, for x=0)

(1, for x>0)  [Equation 5]

Thereafter, “1” is mapped to “0,” while “−1” is mapped to “1.” The Walshcode having a bit length of 32 bits generated by the Rademacher functionis then proved to be identical to the OVSF code as expressed by Equation6.

R1=C32, 1=0000 0000 0000 0000 1111 1111 1111 1111

R2=C32, 2=0000 0000 1111 1111 0000 0000 1111 1111

R3=C32, 4=0000 1111 0000 1111 0000 1111 0000 1111

R4=C32, 8=0011 0011 0011 0011 0011 0011 0011 0011

R5=C32, 16=0101 0101 0101 0101 0101 0101 0101 0101

Here, the code having a bit length of 32 bits generated by theRademacher function and a code generated by the Hadamard function are inbase inversion (i.e. index conversion) relations as expressed byEquation 7.

R1=H5, 16,

R2=H5, 8,

R3=H5, 4,

R4=H5, 2,

R5=H5, 1  [Equation 7]

Accordingly, the OVSF code and the Hadamard code are in base inversionrelations as expressed by Equation 8.

C32, (X1, X2, X3, X4, X5)2=H5, (X5, X4, X3, X3, X1)2  [Equation 8]

In short, index conversion must be performed when decoding theconventional TFCI bits through FHT after encoding and transmitting theTFCI bits as suggested by the present invention through FHT afterencoding. However, when TFCI encoding and transmitting thebarrel-shifted bit pattern, in advance, as in the present invention, thereceiving party need not perform the index conversion.

Moreover, the present invention can be implemented by changing thematrix of base sequences of TFCI encoder.

The first method to build a matrix according to the present invention isto shift the construction of the basis sequences linearly combined withthe conventional TFCI bit patterns while maintaining the prior patternsof the input TFCI bits as shown in Table 4 below.

TABLE 4 Uniform C_(32,16) code C_(32,8) C_(32,1) C_(32,4) C_(32,2)C_(32,2) C_(32,4) ▴ C_(32,1) C_(32,8) Uniform C_(32,16) code Mask1 Mask1Mask2 Mask2 Mask3 Mask3 Mask4 Mask4

The second method is to apply the Hadamard code, which is in indexconversion relations with the OVSF code index rather than the OVSF code,of the basis sequences linearly combined with the prior TFCI bitspatterns while maintaining the prior patterns of the input TFCI bits,and to shift the basis sequences as shown in Table 5 below.

TABLE 5 Uniform H_(5,1) code H_(5,2) C_(32,1) H_(5,4) C_(32,2) H_(5,8)C_(32,4) > H_(5,16) C_(32,8) Uniform C_(32,16) code Mask1 Mask1 Mask2Mask2 Mask3 Mask3 Mask4 Mask4

In addition, the present invention further utilizes the method oflinearly combining a₀ with uniform codes of all 1's, as in theconventional method, instead of applying the pattern as shown in FIG. 6when the number of bits of the TFCI input for encoding is 1, as well asthe method of linearly combining the bit patterns of each type as shownin FIG. 6 in other cases, i.e. when the number of bits of the TFCI bitsinput for encoding is greater than 2.

FIG. 11 is a structure of a transmitting party of the TFCI according toa first embodiment of the present invention while FIG. 12 shows astructure of the TFCI transmitting party according to the secondembodiment of the present invention

Particularly, FIG. 11 shows a hardware construction for encoding andtransmitting the TFCI, to which the bit pattern of FIG. 6 is applicable.In contrast, FIG. 12 shows different arrangements of the ten basissequences linearly combined with the input data bit, while inputting theprior TFCI bits patterns as they are. In other words, FIG. 12 shows abarrel shifting of the symbol codes having all bit values of “1” exceptthe four mask codes (Mask1, Mask2, Mask3, Mask4) among the basissequences used for linear combination as well as five OVSF codes (C32,1, C32,2, C32,4, C32,8, C32,16), and linearly combining the same withthe input data bit. Referring to FIG. 11, the TFCI bits patterns inputto the TFCI encoder can be expressed by Equation 4 described above,According to the TFCI bits patterns and basis sequences patternsapplicable to each TFCI encoder in FIGS. 11 and 12, the following codingis performed in the TFCI encoder with respect to each input as explainedwith reference to FIG. 8.

First, the OVSF coding is performed when the number of bits of the TFCIbits determined by the upper layer is less than 6. Second, thebi-orthogonal coding, which is the first order Reed-Muller coding, isperformed when the number of the TFCI bits determined by the upper layersignalling is 6. Third, the second order Reed-Muller coding is performedwhen the number of bits of the TFCI bits determined by the upper layeris greater than 6.

The code word of 32 bit length generated by coding in accordance withthe input bit numbers of each TFCI bits becomes a code word of 30 bitlength after the first and the 17^(th) bits are punctured. The code wordis once again converted and transmitted. The receiving party thendecodes the converted and transmitted code word. The bit of “0” isconverted to “1,” and the bit of “1” is converted to “−1” in thepunctured code word of 30 bit length.

A decoding structure of the receiving party, corresponding to TFCIencoder shown in FIGS. 11 and 12, will be described with reference toFIG. 13. The decoding procedure of the TFCI code word by the receivingparty will be described thereafter.

FIG. 13 is a block diagram illustrating an optimal TFCI decodingprocedure according to the present invention. Referring to FIG. 13, thereceiving party is unable to know whether the first and the 17^(th) bitsof the code word of 32 bit length punctured by the sending party had abit value of “1” or “0.” Thus, according to the method in the relatedart, a code word of 32 bit length was produced by leaving a blank bit toa corresponding order and decoding when depuncturing a code word of 30bit length received by the receiving party.

When the hardware structure is used for TFCI reception shown in FIGS. 11and 12 according to the present invention, the encoded and transmittedcode word becomes a Hadamard code if the number of input TFCI bits isless than 6. Therefore, errors resulting from decoding can be reduced.Here, the Hadamard code has the following characteristics.

First, if the number of input TFCI bits is 1 to 4, the first and the17^(th) bits of the TFCI code word of 32 bit length always has a bitvalue of “0.” Second, if the number of input TFCI bits is 5, the firstbit of the TFCI code word of 32 bit length always has a bit value of“0.” Therefore, the code of 30 bit length received by the receivingparty according to the present invention is depunctured by using theabove characteristics of Hadamard code.

Since the receiving party knows the number of input TFCI bits due to thesignal processing by the upper layer, depuncturing is performed in thefollowing three manners.

First, when the number of input TFCI bits is 1 to 4, the receiving partyknows that the first and the 17^(th) bits punctured from the 32-bit codeword by the sending party have bit values of “0,” and that the bit value“0” has been mapped and transmitted to “1.” Thus, the receiving partyfills in the first and the 17^(th) bits with “H,” which is apredetermined high bias value. (Case 1)

Second, when the number of input TFCI bits is 5, the receiving partyknows that the first bit punctured from the 32-bit code word by thesending party has a bit value of “0,” and that the bit value “0” hasbeen mapped and transmitted to “1.” Thus, the receiving party fills inthe first bit with “H” for the first bit. Since the receiving party doesnot know whether the 17^(th) bit has a bit value of “1” or “0,” thereceiving party fills in the ₁₇ ^(th) bit with “B,” which is a blankbit. (Case 2)

Third, when the number of input TFCI bits is greater than 6, thereceiving party is unable to know whether the first and the ₁₇ ^(th)bits punctured from the 32-bit code word by the sending party had a bitvalue of “1” or “0.” Thus, the receiving party fills in the 17^(th) bitwith “B.” (Case 3)

Accordingly, the depuncturing block 10 of FIG. 13 in the receiving partyperforms a depuncturing (compensating punctured bits) in accordance withthe number of input TFCI bits as described above. Thereafter, the TFCIdecoder 20 performs a decoding based on the depunctured 32-bit code wordas an input.

Particularly, the receiving party receives the code word R(t) of 30-bitlength as expressed by Equation 9.

R(t)=[R(2) R(3), . . . , R(16) R(18), . . . , R(31) R(32)]  [Equation 9]

The Depuncturing block 10 then performs depuncturing in accordance withthe number of bits of the input TFCI bits to output a code word of32-bit length in accordance with each case as shown in Equations 10 to12 (Case1, Case2, Case3).

[H R(2) R(3), . . . , R(16) H R(18), . . . , R(31) R(32)]  [Equation 10]

 [H R(2) R(3), . . . , R(16) B R(18), . . . , R(31) R(32)]  [Equation11]

[B R(2) R(3), . . . , R(16) B R(18), . . . , R(31) R(32)]  [Equation 12]

In short, after having knowledge on the value of the bit punctured bythe sending party, the receiving party produces a code word of 32-bitlength by substituting the bit value for the corresponding bit position.The TFCI decoder 20 then performs a decoding based on the 32-bit lengthcode word as an input, thereby restoring the desired TFCI bits.

A TFCI encoding method according to the present invention by changingthe matrix of base sequences of TFCI encoder will now be described inmore detail.

When a variable TFCI data bit ranging from a minimum of 1 bit to amaximum of 10 bits is input, the input TFCI data bit and the basissequences linearly combined in the course of encoding is used as shownin Tables 6 and 8. Namely, Table 6 shows the basis sequences used in the(32, 10) TFCI encoding, and Table 8 shows the basis sequences used forthe (16, 5) TFCI encoding.

The (32, 10) TFCI encoding process will first be described withreference to Table 6.

TABLE 6 Invention S_(i.0) S_(i.1) S_(i.2) S_(i.3) S_(i.4) S_(i.5)S_(i.6) S_(i.7) S_(i.8) S_(i.9) (Conventional) (M_(i.1)) (M_(i.2))(M_(i.3)) (M_(i.4)) (M_(i.5)) (M_(i.0)) (M_(i.6)) (M_(i.7)) (M_(i.8))(M_(i.9)) 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 1 1 0 0 0 2 1 1 0 0 0 1 0 00 1 3 0 0 1 0 0 1 1 0 1 1 4 1 0 1 0 0 1 0 0 0 1 5 0 1 1 0 0 1 0 0 1 0 61 1 1 0 0 1 0 1 0 0 7 0 0 0 1 0 1 0 1 1 0 8 1 0 0 1 0 1 1 1 1 0 9 0 1 01 0 1 1 0 1 1 10 1 1 0 1 0 1 0 0 1 1 11 0 0 1 1 0 1 0 1 1 0 12 1 0 1 1 01 0 1 0 1 13 0 1 1 1 0 1 1 0 0 1 14 1 1 1 1 0 1 1 1 1 1 15 1 0 0 0 1 1 11 0 0 16 0 1 0 0 1 1 1 1 0 1 17 1 1 0 0 1 1 1 0 1 0 18 0 0 1 0 1 1 0 1 11 19 1 0 1 0 1 1 0 1 0 1 20 0 1 1 0 1 1 0 0 1 1 21 1 1 1 0 1 1 0 1 1 122 0 0 0 1 1 1 0 1 0 0 23 1 0 0 1 1 1 1 1 0 1 24 0 1 0 1 1 1 1 0 1 0 251 1 0 1 1 1 1 0 0 1 26 0 0 1 1 1 1 0 0 1 0 27 1 0 1 1 1 1 1 1 0 0 28 0 11 1 1 1 1 1 1 0 29 1 1 1 1 1 1 1 1 1 1 30 0 0 0 0 0 1 0 0 0 0 31 0 0 0 01 1 1 0 0 0

As shown in Table 6 above, the relations between the basis sequences inTable 6 and those in Table 3 can be expressed by Equation 13.

S _(i,j−1) =M _(i,j) (j=1,2,3,4)

S _(i,5) =M _(i,0)

S _(i,j) =M _(i,j) (j=6, 7, 8, 9)  [Equation 13]

where the first and the 17^(th) bits of M_(i,j) is moved to the last twobits at S_(i,j)

The basis sequences linearly combined for encoding according to thepresent invention are applied in the following order. “Si, 0, Si, 1, Si,2, Si, 3, Si, 4” corresponding to five OVSF codes represented by “C32,1, C32, 2, C32, 4, C32, 8, C32, 16”; “Si,6, Si,7, Si, 8, Si, 9”corresponding to four mask codes represented by the conventional “Mask1,Mask2, Mask3, Mask4”; and “Si, 5” which is a single uniform code havingall bit values of “1.”

Accordingly, a conversion matrix for encoding a TFCI would include fivecolumn vectors of 32 elements of binary code derived from OVSF codeswhich are to be multiplied to lower bits of the TFCI, one column vectorof 32 elements of 1, and four column vectors of 32 elements of binarycode derived from mask codes which are to be multiplied to upper bits ofthe TFCI. Here, the five column vectors are derived by moving a firstelement and a 17^(th) element of a normal 32 element OVSF code vectorsto last two positions of the OVSF code vectors, as will be described indetail below. Also, a column vector of the five column vectors which isto be multiplied to a least significant bit of the TFCI is derived froman OVSF code which alternates bits, element by element.

FIG. 14 is a diagram illustrating a structure of the (32, 10) TFCIencoder according to the present invention. Referring to FIG. 14,encoding is performed according to the present invention using Equations14 to output a (32, 10) code word when the TFCI data bits (az=a9a8,a7 .. . a1a0) are input to the (32, 10) TFCI encoder.

bi=Σ(a_(n)×S_(i,n)) mod2 (where, n=0 to 9)  [Equation 14]

In Equations 14, i=0, 2, . . . , 31. Also, the Equation 14 is applicablewhen TFCI data bit index Z is “0≦Z≦8,” while the uniform code isapplicable when TFCI data bit index Z is “9,” i.e. only one TFCI bit isinput. Accordingly, in the present method for transmitting the TFCI, theTFCI is coded by multiplying with the conversion matrix as describeabove if the number of input TFCI bits are more than two or by repeatingthe input TFCI bit if the number of input TFCI is one bit.

The TFCI code word encoded as described above is divided into fifteendouble bits and inserted into each time slot for transmission, and thusthe entire length thereof is fixed to be 30 bits. Accordingly, theencoded 32-bit length TFCI code word is punctured by 2 bits and insertedinto each time slot. According to the prior specification of 3GPPstandard, the 1^(st) and 17^(th) bits of (32,10) sub-code of secondorder Reed-Muller code word are punctured into (30,10) code word. Thefollowing shows the 1^(st) and 17^(th) bits of Hadamard codes of length32.

1^(st) bit 17^(th) bit H₀ 0 . . . 0 . . . H₁ 0 . . . 0 . . . — — — — — —H₁₅ 0 . . . 0 . . . H₁₆ 0 . . . 1 . . . H₁₇ 0 . . . 1 . . . — — — — — —H₃₁ 0 . . . 1 . . .

When Z equals 5, the 1^(st) bit of TFCI code word always becomes ‘0.’Similarly, when Z is greater than 5, the 1^(st) and 17^(th) bits of codeword always become ‘0.’ This implies that the receiver exactly knows the1^(st) and 17^(th) bits when the number of zeros padded to the TFCIencoder is larger than 5, and knows the 1^(st) bit when the number ofzeros padded is 5. This interesting property allows a performance gainas well as hardware flexibility at the side of a TFCI decoder since again can be obtained simply by inserting the known punctured bit or bitsat the side of receiver without changing the (32,10) TFCI decoder.

The present method punctures the last 31^(st) bit and the 32^(nd) bitamong the 32-bit length TFCI code word, since the basis sequences hadbeen rearranged to move the first bit to the 31^(st) bit and the 17^(th)to the 32^(nd) bit. In the conventional method in which basis sequenceis not rearranged, the code bit having a value of “1” is punctured.However, in the present invention, no code bit having a value of “1” ispunctured when the input TFCI data bit is ranged from a₀ to as since thelast 2 bits are punctured among the 32-bit length TFCI word. Therefore,a maximized minimum hamming distance is gained.

A (16, 5) TFCI encoding process will now be explained with reference toTable 7 below, which shows basis sequences used for the (16, 5) TFCIencoding process according to the present invention.

TABLE 7 i M_(i.0) M_(i.1) M_(i.2) M_(i.3) M_(i.4) S_(i.0) S_(i.1)S_(i.2) S_(i.3) S_(i.4) 0 1 0 0 0 0 1 0 0 0 1 1 1 1 0 0 0 0 1 0 0 1 2 10 1 0 0 1 1 0 0 1 3 1 1 1 0 0 0 0 1 0 1 4 1 0 0 1 0 1 0 1 0 1 5 1 1 0 10 0 1 1 0 1  6 1 0 1 1 0 1 1 1 0 1 7 1 1 1 1 0 0 0 0 1 1 8 1 0 0 0 1 1 00 1 1 9 1 1 0 0 1 0 1 0 1 1 10 1 0 1 0 1 1 1 0 1 1 11 1 1 1 0 1 0 0 1 11 12 1 0 0 1 1 1 0 1 1 1 13 1 1 0 1 1 0 1 1 1 1 14 1 0 1 1 1 1 1 1 1 115 1 1 1 1 1 0 0 0 0 1

As shown in Table 8, the relations between the basis sequences accordingto the conventional art and those according to the present invention canbe expressed by Equation 15.

 S _(i−1,j−1) =M _(i,j)(i=1, ,14, 15)(j=1, 2, 3, 4)

S _(i5,j−1) =M _(i,j)(j=1, 2, 3, 4)

S _(i,4) =M _(i,0)  [Equation 15]

The basis sequences linearly combined for encoding, which are applicableaccording to the present invention, are “Si,0, Si,1, Si,2, Si,3, Si,4”corresponding to five OVSF codes expressed as “C32,1, C32,3, C32,4,C32,8, C32,16” from the top under the conventional art.

Thus, a conversion matrix for encoding the TFCI includes four columnvectors of 16 elements of binary code derived from codes orthogonal toone another which are to be multiplied to the lower bits of the TFCI andone column vector of 16 elements of 1. Also, as will be described below,the four column vectors are derived by moving a first element of normal16 element orthogonal code vectors to last positions of the orthogonalcode vectors, and a column vector of the four column vectors which is tobe multiplied to a least significant bit of the TFCI is made from anorthogonal code which alternates bits, element by element.

FIG. 15 is a diagram illustrating a structure of the (16, 5) TFCIencoder according to the present invention. Referring to FIG. 15, whenthe TFCI data bits (a_(z)=a₄, .a₁, a₈) are input to a (16, 5) encoder,encoding is performed using Equation 16 according to the presentinvention.

bi=Σ(a_(n)×S_(i,n)) mod2 (where, n=0 to 4)  [Equation 16]

In Equation 16, i=0, 2 . . . 15. Equation 16 is applicable when the TFCIdata bit index Z is “0≦Z≦3.” If the TFCI consist of 1 bit, that is“Z=4,” repetition is used for coding. Namely, a₀ is repeated 16 timesfor b_(i).

The (16, 5) TFCI code word encoded as described above is divided into 1bit each, inserted into each time slot, and transmitted. Because theentire length is fixed to 15 bits, the encoded TFCI code word of 16 bitlength is punctured for 1 bit, and inserted into each time slot. Here,the last 16^(th) bit among the TFCI code word of 16 bit length ispunctured.

The encoding procedure as described above can also be used for splitmode. In case of DCH in a Split Mode, the UTRAN operates as follows. Ifone of the links is associated with a DSCH, the TFCI code word may besplit in such a way that the code word relevant for TFCI activityindication is not transmitted from every cell. The use of such afunctionality shall be indicated by higher layer signalling.

The TFCI bits are encoded using a (16, 5) bi-orthogonal (or first orderReed-Muller) code. The coding procedure is as shown in FIG. 16.

 b2i=Σ(a _(1,n) ×S _(i,n)) mod2 (where, n=0 to 4)

b2i+1=Σ(a _(2,n) ×S _(i,n)) mod2 (where, n=0 to 4)  [Equation 17]

In Equation 17, i=0, 2 . . . 15. Equation 17 is applicable when the TFCIdata bit index Z is “0≦Z≦3.” If the TFCI consist of 1 bit, that is“Z=4,” repetition is used for coding. Namely, a_(1,0) is repeated 16times for b_(2i) and a_(2,0) is repeated 16 times for b_(2i+1),Accordingly, in the present method for transmitting the TFCI, the TFCIbits are coded by multiplying a conversion matrix as described above ifthe number of TFCI bits are more than two or by repeating the TFCI bitif the number of TFCI is one bit.

As described above, the present invention has the following advantageouseffects.

First, the receiving party can decode an encoded and transmitted TFCIcode word through a more simple procedure using an optimal TFCI encodingmethod. Second, when the number of bits of the input TFCI bits is lessthan 6, the receiving party performs depuncturing by substituting a highbias value for the bit position punctured by the sending party. Thereceiving party therefore is able to know the encoded code word, and mayundergo a more simple procedure in decoding the transmitted code word.As a result, the hardware required can also be reduced, thereby reducingthe cost. Moreover, a maximized minimum hamming distance is gained withrespect to the TFCI code word when inserting and transmitting the TFCIcode word by 1 bit or 2 bits per time slot after puncturing the TFCIcode word. The minimum hamming distance is thus maximized with respectto the TFCI code word and the performance of the entire system isenhanced.

The foregoing embodiments are merely exemplary and are not to beconstrued as limiting, the present invention. The present teachings canbe readily applied to over types of apparatuses. The description of thepresent invention is intended to be illustrative, and not to limit thescope of the claims. Many alternatives, modifications, and variationswill be apparent to those skilled in the art.

What is claimed is:
 1. A method of generating a conversion matrix forencoding a TFCI of a mobile telecommunication system comprising:generating five column vectors of the conversion matrix with 32 elementsof binary code derived from OVSF codes, where said five columns vectorsare to be multiplied to lower bits of the TFCI; setting one columnvector of the conversion matrix with 32 elements to 1; generating fourcolumn vectors of the conversion matrix with 32 elements of binary codederived from Mask codes, where said four column vectors are to bemultiplied to upper bits of the TFCI.
 2. The method of claim 1, whereinsaid five column vectors are generated by moving a first element and a17^(th) element of a normal 32 element OVSF code vectors to last twopositions of the OVSF code vectors.
 3. The method of claim 1, wherein acolumn vector of said five column vectors which is to be multiplied to aleast significant bit of the TFCI is generated from an OVSF code whichalternates bits element by element.
 4. The method of claim 3, whereinsaid five column vectors are generated by moving a first element and a17^(th) element of a normal 32 element OVSF code vectors to last twopositions of the OVSF code vectors.
 5. A method for transmitting a TFCIof a mobile telecommunication system comprising: detecting a number ofinput TFCI bits; coding with a conversion matrix; and transmitting thecoded bits through radio channel; wherein said conversion matrixcomprises five column vectors of 32 elements of binary code derived fromOVSF codes which are to be multiplied to lower bits of the TFCI, onecolumn vector of 32 elements of 1, and four column vectors of 32elements of binary code derived from mask codes which are to bemultiplied to upper bits of the TFCI.
 6. A method of claim 5, whereinthe five column vectors of said conversion matrix are made by moving afirst element and a 17^(th) element of normal 32 element OVSF codevectors to last two positions of the OVSF code vectors.
 7. A method ofclaim 5, wherein a column vector of said five column vectors of saidconversion matrix which is to be multiplied to a least significant bitof the TFCI is made from an OVSF code which alternates bits element byelement.
 8. A method of claim 7, wherein the five column vectors of saidconversion matrix are made by moving a first element and a 17^(th)element of normal 32 element OVSF code vectors to last two positions ofthe OVSF vectors.
 9. A method for transmitting a TFCI of a mobiletelecommunication system comprising: detecting a number of input TFCIbits; coding by multiplying a conversion matrix if the number of inputTFCI bits are more than two or repeating the input TFCI bit if thenumber of input TFCI is one bit; and transmitting the coded bits throughradio channel; wherein said conversion matrix comprises five columnvectors of 32 elements of binary code derived from OVSF codes which areto be multiplied to lower bits of the TFCI, one column vector of 32elements of 1, and four column vectors of 32 elements of binary codederived from mask codes which are to be multiplied to upper bits of theTFCI.
 10. A method of claim 9, wherein the five column vectors of saidconversion matrix are made by moving a first element and a 17^(th)element of normal 32 element OVSF code vectors to last two positions ofthe OVSF code vectors.
 11. A method of claim 9, wherein a column vectorof said five column vectors of said conversion matrix which is to bemultiplied to a least significant bit of the TFCI is made from an OVSFcode which alternates bits element by element.
 12. A method of claim 11,wherein the five column vectors of said conversion matrix are made bymoving a first element and a 17^(th) element of normal 32 element OVSFcode vectors to last two positions of the OVSF vectors.
 13. A method ofgenerating a conversion matrix for encoding a TFCI of a mobiletelecommunication system comprising: generating four column vectors ofthe conversion matrix having 16 elements of binary code from orthogonalcodes, where said four column vectors are to be multiplied to lower bitsof the TFCI; and setting one column vector of the conversion matrixhaving 16 elements to
 1. 14. A method of claim 13, wherein said fourcolumn vectors are generated by moving a first element of normal 16element orthogonal code vectors to last positions of the orthogonal codevectors.
 15. A method of claim 13, wherein a column vector of said fourcolumn vectors which is to be multiplied to a least significant bit ofthe TFCI is made from an orthogonal code which alternates bits, elementby element.
 16. A method of claim 15, wherein said four column vectorsare generated by moving a first element of normal 16 element orthogonalcode vectors to last positions of the orthogonal code vectors.
 17. Amethod for transmitting a TFCI of a mobile telecommunication systemcomprising: detecting a number of input TFCI bits; coding with aconversion matrix; and transmitting the coded bits through radiochannel; wherein said conversion matrix comprises four column vectors of16 elements of binary code derived from codes orthogonal to one anotherwhich are to be multiplied to the lower bits of the TFCI, and one columnvector of 16 elements of
 1. 18. A method of claim 17, wherein said fourcolumn vectors are generated by moving a first element of normal 16element orthogonal code vectors to last positions of the orthogonal codevectors.
 19. A method of claim 17, wherein a column vector of said fourcolumn vectors which is to be multiplied to a least significant bit ofthe TFCI is made from an orthogonal code which alternates bits, elementby element.
 20. A method of claim 19, wherein said four column vectorsare generated by moving a first element of normal 16 element orthogonalcode vectors to last positions of the orthogonal code vectors.
 21. Amethod for transmitting a TFCI of a mobile telecommunication systemcomprising: detecting a number of input TFCI bits; coding by multiplyinga conversion matrix if the number of TFCI bits are more than two orrepeating the TFCI bit if the number of TFCI is one bit; andtransmitting the coded bits through radio channel; wherein saidconversion matrix comprises four column vectors of 16 elements of binarycode derived from codes orthogonal to one another which are to bemultiplied to the lower bits of the TFCI, and one column vector of 16elements of
 1. 22. A method of claim 21, wherein said four columnvectors are generated by moving a first element of normal 16 elementorthogonal code vectors to last positions of the orthogonal codevectors.
 23. A method of claim 21, wherein a column vector of said fourcolumn vectors which is to be multiplied to a least significant bit ofthe TFCI is made from an orthogonal code which alternates bits, elementby element.
 24. A method of claim 23, wherein said four column vectorsare generated by moving a first element of normal 16 element orthogonalcode vectors to last positions of the orthogonal code vectors.
 25. Amethod for transmitting a Transport Format Combination Indicator (TFCI)in a radio communication system, comprising: inputting TFCI informationbits; encoding the TFCI information bits with the following basesequences; and 1 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 0 1 0 1 1 0 1 0 1 0 1 1 01 1 1 1 0 1 0 0 0 1 1 1 0 0 1 1 0 1 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 10 1 1 1 1 1 1 1 1 1 0 0 0 0 1

transmitting the encoded code sequence as a TFCI code.
 26. A radiocommunication device transmitting Transport Format Combination Indicator(TFCI), comprising: a TFCI encoder for encoding the TFCI informationbits with the following base sequences; and 1 0 0 0 1 0 1 0 0 1 1 1 0 01 0 0 1 0 1 1 0 1 0 1 0 1 1 0 1 1 1 1 0 1 0 0 0 1 1 1 0 0 1 1 0 1 0 1 11 1 0 1 1 0 0 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 0 0 0 0 1

a transmitter for transmitting the encoded code sequence as a TFCI code.